SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

Authors

  • Ali Mahmoodirad Department of Mathematics, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran. Iran, Islamic Republic of
  • Masoud Sanei Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran. Iran, Islamic Republic of
  • Reza Soltani Department of Industrial Engineering, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran. Iran, Islamic Republic of
  • Saber Molla-Alizadeh-Zavardehi Department of Industrial Engineering, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran.
Abstract:

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For comparing GA and MA, twenty eight problems with different specifics have been generated at random and then the quality of the proposed algorithms was evaluated using the relative percentage deviation (RPD) method. Finally, based on RPD method, we investigate the impact of increasing the problem size on the performance of our proposed algorithms.  

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

full text

Lagrangian Relaxation Method for the Step fixed-charge Transportation Problem

In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...

full text

AN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM

Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...

full text

Modeling and solving a three-stage fixed charge transportation problem considering stochastic demand and price

This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a...

full text

A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem

This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The prop...

full text

Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller

The nonlinear side constraint transportation problem (nscTP) arises when we want to find the reasonable assignment strategy to satisfy the source and destination requirement without shipping goods from sources to any pairs of prohibited destinations simultaneously so that the total cost can be minimized. With this side constraint, the difficulty of the problem increase significantly and it beco...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2 (SPRING)

pages  177- 187

publication date 2014-03-21

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023